Fast Approximation of Distance Between Elastic Curves using Kernels

نویسندگان

  • Hedi Tabia
  • David Picard
  • Hamid Laga
  • Philippe Henri Gosselin
چکیده

Elastic shape analysis on non-linear Riemannian manifolds provides an efficient and elegant way for simultaneous comparison and registration of non-rigid shapes. In such formulation, shapes become points on some high dimensional shape space. A geodesic between two points corresponds to the optimal deformation needed to register one shape onto another. The length of the geodesic provides a proper metric for shape comparison. However, the computation of geodesics, and therefore the metric, is computationally very expensive as it involves a search over the space of all possible rotations and reparameterization. This problem is even more important in shape retrieval scenarios where the query shape is compared to every element in the collection to search. In this paper, we propose a new procedure for metric approximation using the framework of kernel functions. We will demonstrate that this provides a fast approximation of the metric while preserving its invariance properties.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TABIA et al.: FAST APPROXIMATION OF DISTANCE BETWEEN ELASTIC CURVES USING KERNELS

Elastic shape analysis on non-linear Riemannian manifolds provides an efficient and elegant way for simultaneous comparison and registration of non-rigid shapes. In such formulation, shapes become points on some high dimensional shape space. A geodesic between two points corresponds to the optimal deformation needed to register one shape onto another. The length of the geodesic provides a prope...

متن کامل

یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیک‌های یادگیری معیار فاصله

Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...

متن کامل

A B INITIO CALCULATION OF THE KC1 PHONON FREQUENCIES

We have calculated the phonon frequencies of KC1 along symmetry directions using an approach which is a combination of the frozen phonon and force constants methods. We also calculated Griineisen parameters for all modes at X and L points in the Brillouin zone. Finally, the slope of acoustic dispersion curves around zone center were used to calculate the three independent elastic coefficien...

متن کامل

FFT-based Alignment of 2d Closed Curves with Application to Elastic Shape Analysis

For many shape analysis problems in computer vision and scientific imaging (e.g., computational anatomy, morphological cytometry), the ability to align two closed curves in the plane is crucial. If the curves have the same length and are centered at the origin, the critical steps to an optimal alignment are finding the best rotation for one curve to match the other and redefining the starting p...

متن کامل

Fast Fréchet Distance Between Curves With Long Edges

Computing Fréchet distance between two curves takes roughly quadratic time. In this paper, we show that for curves with long edges the Fréchet distance computations become easier. Let P and Q be two polygonal curves in R with n and m vertices, respectively. We prove four main results for the case when all edges of both curves are long compared to the Fréchet distance between them: (1) a linear-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013